-
1 приведенный автомат
Русско-английский словарь по вычислительной технике и программированию > приведенный автомат
-
2 приведенный автомат
Русско-английский большой базовый словарь > приведенный автомат
-
3 приведенный
Русско-английский новый политехнический словарь > приведенный
-
4 приведенный автомат
reduced automaton мат.Русско-английский научно-технический словарь Масловского > приведенный автомат
-
5 конечный автомат
1. finite state automaton2. finite state machine3. finite automaton4. finite-state automaton5. state machineРусско-английский большой базовый словарь > конечный автомат
-
6 приведенный
1. reduced2. given; reduced -
7 приведённый автомат
Information technology: cast automation, cast automaton, reduced automatonУниверсальный русско-английский словарь > приведённый автомат
См. также в других словарях:
automaton — noun /ɔːˈtɒmətən,ɔːˈtɒməˌtɒn/ a) A machine or robot designed to follow a precise sequence of instructions. Due to her strict adherence to her daily schedule, Jessica was becoming more and more convinced that she was an automaton. b) A formal… … Wiktionary
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Von Neumann cellular automaton — Von Neumann cellular automata are the original expression of cellular automata, the development of which were prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanisław Ulam. Their original purpose was … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Nagel-Schreckenberg model — The Nagel Schreckenberg model is a theoretical model for the simulation of freeway traffic. The model was developed in the early 90s by the German physicists Kai Nagel and Michael Schreckenberg[1]. It is essentially a simple cellular automaton… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Langton's loops — Langton s Loop, in the starting configuration. Langton s loops are a particular species of artificial life in a cellular automaton created in 1984 by Christopher Langton. They consist of a loop of cells containing genetic information, which flows … Wikipedia